Search for Largest Polyhedra

A strongly polynomial algorithm for line search in submodular polyhedra

A submodular polyhedron is a polyhedron associated with a submodular function. This paper presents a strongly polynomial time algorithm for line search in submodular polyhedra with the aid of a fully combinatorial algorithm for submodular function minimization. The algorithm is based on the parametric search method proposed by Megiddo.

the search for the self in becketts theatre: waiting for godot and endgame

this thesis is based upon the works of samuel beckett. one of the greatest writers of contemporary literature. here, i have tried to focus on one of the main themes in becketts works: the search for the real "me" or the real self, which is not only a problem to be solved for beckett man but also for each of us. i have tried to show becketts techniques in approaching this unattainable goal, base...

Algorithm for finding the largest inscribed rectangle in polygon

In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...

CiNii: Bringing Linked Data to Japan's Largest Scholarly Search Engine

The Discretized Polyhedra Simpli cation ( DPS ) : a Framework for Polyhedra

Automatic simpliication of polyhedral objects is a major topic in many computer graphics applications. This work discusses simpliication algorithms for the generation of a multiresolution family of solid representations from an initial polyhedral solid. We introduce the Discretized Polyhedra Simpliication (DPS), a framework for polyhedra simpliication using space decomposition models. The DPS i...